2D single bin packing 问题的4Block算法-4-Block Algorithm for 2D single bin packing Problem

Bin packing problem belongs to the class of NP-hard problems, like the others that were discussed in previous articles. The task is to pack a set of items of different size into bins of fixed size in such way that minimal number bins is used. Dependi

2d packing algorithm